package binarySearch;

//https://leetcode.cn/problems/que-shi-de-shu-zi-lcof/
public class l_lcr_173 {
    public int takeAttendance(int[] records) {
        int left = 0, right = records.length - 1;
        //easy 思路不说明了
        while(left < right)
        {
            int mid = left + (right - left) / 2;
            if(records[mid] == mid) left = mid + 1;
            else right = mid;
        }
        return left == records[left] ? left + 1 : left;
    }
}
